ACTL Local Model Update with Constraints
نویسندگان
چکیده
The recent development of model update aims to enhance model checking functions and provides computer aided modifications in system development. On the other hand, constraints have been playing an essential role in describing rational system behaviours. In previous model update approaches, constraints are usually not considered in the update process. In this paper, we present an ACTL a widely used fragment of Computation Tree Logic (CTL), local model update approach where constraints have been explicitly taken into account. This approach handles constraints effectively by integrating constraint automata into the underlying model update. We demonstrate the effectiveness of our approach through the case study of the correction of the well known mutual exclusion program.
منابع مشابه
Foundations of Tree-like Local Model Updates
Model update is an approach to enhance model checking functions by providing computer aided modifications in system development [2, 9]. It has been observed that one major obstacle restricting the application of this approach, e.g. CTL model update [15], is that the update has to take the entire system model into account, and that is usually not feasible for large scale domains. In this paper, ...
متن کاملModel Checking with SAT-Based Characterization of ACTL Formulas
Bounded semantics of LTL with existential interpretation and that of ECTL (the existential fragment of CTL), and the characterization of these existentially interpreted properties have been studied and used as the theoretical basis for SAT-based bounded model checking [2, 18]. This has led to a lot of successful work with respect to error detection in the checking of LTL and ACTL (the universal...
متن کاملSymbolic Model Checker for ACTL ?
We present SAM, a symbolic model checker for ACTL, the action-based version of CTL. SAM relies on implicit representations of Labeled Transition Systems (LTSs), the semantic domain for ACTL for-mulae, and uses symbolic manipulation algorithms. SAM has been realized by translating (networks of) LTSs and, possibly recursive, ACTL formulae into BSP (Boolean Symbolic Programming), a programming lan...
متن کاملBounded Semantics of CTL and SAT-Based Verification
Bounded model checking has been proposed as a complementary approach to BDD based symbolic model checking for combating the state explosion problem, esp. for efficient error detection [3]. This has led to a lot of successful work with respect to error detection in the checking of LTL, ACTL (the universal fragment of CTL) and ACTL* properties by satisfiability testing [3, 22, 25]. The use of bou...
متن کاملAn Action Computation Tree Logic With Unless Operator
This paper is about action computation tree logic (ACTL), a propositional branching-time temporal logic very suitable for specifying properties of concurrent systems described with processes. A new variant of ACTL is introduced, which is based on temporal operators until and unless, whereas all other temporal operators are derived from them. A fixed point characterisation usable for global mode...
متن کامل